minimization$501243$ - определение. Что такое minimization$501243$
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое minimization$501243$ - определение

Cost-minimization; Weak axiom of cost minimization

DFA minimization         
  • Example DFA. If in state <math>c</math>, it exhibits the same behavior for every input string as in state <math>d</math>, or in state <math>e</math>. Similarly, states <math>a</math> and <math>b</math> are nondistinguishable. The DFA has no unreachable states.
  • Equivalent minimal DFA. Nondistinguishable states have been merged into a single one.
In automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language.
Energy minimization         
WAY OF EXPLORING REACTION PATHS IN COMPUTATIONAL CHEMISTRY
Geometry optimization; Energy minimization (energy optimization)
In the field of computational chemistry, energy minimization (also called energy optimization, geometry minimization, or geometry optimization) is the process of finding an arrangement in space of a collection of atoms where, according to some computational model of chemical bonding, the net inter-atomic force on each atom is acceptably close to zero and the position on the potential energy surface (PES) is a stationary point (described later). The collection of atoms might be a single molecule, an ion, a condensed phase, a transition state or even a collection of any of these.
minimal automaton         
  • Example DFA. If in state <math>c</math>, it exhibits the same behavior for every input string as in state <math>d</math>, or in state <math>e</math>. Similarly, states <math>a</math> and <math>b</math> are nondistinguishable. The DFA has no unreachable states.
  • Equivalent minimal DFA. Nondistinguishable states have been merged into a single one.
<theory> An automaton possessing with redundant states. (1996-05-03)

Википедия

Cost-minimization analysis

Cost-minimization is a tool used in pharmacoeconomics to compare the cost per course of treatment when alternative therapies have demonstrably equivalent clinical effectiveness.

Therapeutic equivalence (including adverse reactions, complications and duration of therapy) must be referenced by the author conducting the study and should have been done prior to the cost-minimization work. Since equal efficacy and equal tolerability is already demonstrated, there is no requirement to find a common efficacy denominator as would be the case when conducting a cost-effectiveness study. The author is not precluded from doing so through the use of "cost/cure" or "cost/year of life gained". If efficacy and tolerability is demonstrated, however, then a simple comparison of "cost/course of treatment" can suffice for the purpose of comparing two or more therapeutically equivalent treatment alternatives. When conducting a cost-minimization study, the author needs to measure all costs (resource expenditures) inherent to the delivery of the therapeutic intervention and that are relevant to the pharmacoeconomic perspective. The optimal choice is that which can be provided for the lowest cost.